running in time meaning in English
磨合时间
Examples
- Polynomial - time approximation schemes ( ptas ) : a ptas is a family of algorithm { a | > 0 } such that for any fixed > 0 , a runs in time polynomial in the length of the input and gets a solution with an objective value which is at most 1 + e times of the optimum
若每次修正后，实例的目标函数值不超过原来的1 + o ( )倍，我们称修正费用不超过1 + o ( ) 。 ptas算法：若算法列{ a _ }对于问题的任一个例子都是1 +近似算法，计算次数是问题大小的多项式(将视为常数) ，称它为ptas算法。